Continuous Queries in Oracle
نویسندگان
چکیده
This paper describes Continuous Queries (CQ) in Oracle RDBMS, a feature that incorporates stream and complex event processing into an RDBMS, the first such attempt in commercial databases. The feature is based on the concept of query difference and allows us to monitor real time changes to the query as the result of changes to its underlying tables. The result of a continuous query can be deposited into historical tables or queues for further asynchronous de-queuing, or can invoke a synchronous trigger for procedural processing. The main contribution of our CQ engine is that it allows us to react to complex scenarios of changes to data such as mixed INSERT, DELETE and UPDATE changes, unlike the existing stream processing systems that deal with INSERTS only. We support a wide range of query shapes including inner, semi and anti-joins, aggregates and window functions. More details are given to the efficient computation of query difference for general cases and their optimizations based on semantic constraints. They are shown to improve the response time for practical cases by more than an order of magnitude. We also show how delaying CQ re-computation can improve its performance by batch processing the changes to the base tables.
منابع مشابه
Computability and Complexity over the Product Topology of Real Numbers
Kawamura and Cook have developed a framework for studying the computability and complexity theoretic problems over “large” topological spaces. This framework has been applied to study the complexity of the differential operator and the complexity of functionals over the space of continuous functions on the unit interval C[0, 1]. In this paper we apply the ideas of Kawamura and Cook to the produ...
متن کاملEfficient Maintenance of Continuous Queries for Trajectories
We address the problem of optimizing the maintenance of continuous queries in Moving Objects Databases, when a set of pending continuous queries need to be reevaluated as a result of bulk updates to the trajectories of moving objects. Such bulk updates may happen when traffic abnormalities, e.g., accidents or road works, affect a subset of trajectories in the corresponding regions, throughout t...
متن کامل1 Commutative Queries
7 We consider polynomial-time Turing machines that have access to two oracles and investigate when the order of oracle queries is significant. The oracles used here are complete languages for the Polynomial Hierarchy (PH). We prove that, for solving decision problems, the order of oracle queries does not matter. This improves upon the previous result of Hemaspaandra, Hemaspaandra and Hempel, wh...
متن کاملCommutative Queries
7 We consider polynomial-time Turing machines that have access to two oracles and investigate when the order of oracle queries is significant. The oracles used here are complete languages for the Polynomial Hierarchy (PH). We prove that, for solving decision problems, the order of oracle queries does not matter. This improves upon the previous result of Hemaspaandra, Hemaspaandra and Hempel, wh...
متن کاملReal Hypercomputation with Infinite Oracle Queries
We define Oracle-Type-2-Machine capable of writing infinite oracle queries. In contrast to finite oracle queries, this extends the realm of oracle-computable function into the discontinuous realm. Our definition is conservative; access to a computable oracle does not increase the computational power. Other models of real hypercomputation such as Ziegler’s (finitely) revising computation ([4], [...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007